Total chromatic number of graphs of odd order and high degree
نویسندگان
چکیده
منابع مشابه
The Total Chromatic Number of Graphs of High Minimum Degree
If G is a simple graph with minimum degree <5(G) satisfying <5(G) ^ f(| K(C?)| -f-1) the total chromatic number conjecture holds; moreover if S(G) ^ f| V(G)\ then #T(G) < A(G) + 3. Also if G has odd order and is regular with d{G) ^ \^/1\V{G)\ then a necessary and sufficient condition for ^T((7) = A((7)+ 1 is given.
متن کاملThe total chromatic number of regular graphs of even order and high degree
The total chromatic number T (G) of a graph G is the minimum number of colours needed to colour the edges and the vertices ofG so that incident or adjacent elements have distinct colours. We show that if G is a regular graph of even order and (G) 3 |V (G)| + 23 6 , then T (G) (G)+ 2. © 2005 Elsevier B.V. All rights reserved.
متن کاملTOTAL CHROMATIC NUMBER OF GRAPHS OF ORDER 2«+l HAVING MAXIMUM DEGREE
Let G be a graph of order 2n+ 1 having maximum degree 2n—\. We prove that the total chromatic number of G is 2/i if and only if e(G — w) + oc'(G — w)^n, where w is a vertex of minimum degree in G, G — w is the complement of G — w, e(G — w) is the size of G — w, and a'(G-w) is the edge independence number of G — w.
متن کاملTotal-Chromatic Number and Chromatic Index of Dually Chordal Graphs
A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly chordal graphs and interval graphs. We prove that Vizing's total-colour conjecture holds for dually chordal graphs. We describe a new heuristi...
متن کاملCircular Chromatic Number of Planar Graphs of Large Odd Girth
It was conjectured by Jaeger that 4k-edge connected graphs admit a (2k + 1, k)-flow. The restriction of this conjecture to planar graphs is equivalent to the statement that planar graphs of girth at least 4k have circular chromatic number at most 2 + 1 k . Even this restricted version of Jaeger’s conjecture is largely open. The k = 1 case is the well-known Grötzsch 3-colour theorem. This paper ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1999
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(99)00034-5